Sensitivity invariants for linear time-invariant networks
نویسندگان
چکیده
منابع مشابه
On Reciprocity in Linear Time-Invariant Networks
Swin,,ory.-A genenil time-domsin definition of reo'pmdry ir given in terms of network-pon vxiables, and this dcfmilion i? npptied to eoncludc the symmetry of ncnvork mnuicrr, even in the ua~. of amvc, nonfrrurc networks. A new proof is presented of the rmpraclry of Gnllr. nrworkr composed of ttrnc-invarimt rnirtors, apantors, inductors and transformma, and this proof is also applied to show the...
متن کاملAN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS
The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis
متن کاملLinear Time-invariant Systems
control scheme, in which different time scales for the rigid body subsystem dynamics and for the flexible dynamics are used (Canudas de Wit et al., 1996). An application of the two-time scale method is shown, for example, in Kang, Yeung, and Mills (2002). In summary, the aim of the authors to provide an upperlevel undergraduate and graduate textbook and a reference for experienced professionals...
متن کاملOn Swarm Stability of Linear Time-Invariant Descriptor Compartmental Networks
Swarm stability is concerned for descriptor compartmental networks with linear time-invariant protocol. Compartmental network is a specific type of dynamical multi-agent system. Necessary and sufficient conditions for both consensus and critical swarm stability are presented, which require a joint matching between the interactive dynamics of nearest neighboring vertices and the Laplacian spectr...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuit Theory
سال: 1973
ISSN: 0018-9324
DOI: 10.1109/tct.1973.1083604